<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1.0,viewport-fit=cover"><title>单链表的C_C++语言描述实现模板 | 夜悊的技术小宅</title><meta name="author" content="夜悊"><meta name="copyright" content="夜悊"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="前言数据结构中单链表的C&#x2F;C++语言描述实现模板，有详细的步骤解析及使用示例。  代码仓库 yezhening&#x2F;Programming-examples: 编程实例 (github.com) Programming-examples: 编程实例 (gitee.com)   linkList.cpp12345678910111213141516171819202122232425">
<meta property="og:type" content="article">
<meta property="og:title" content="单链表的C_C++语言描述实现模板">
<meta property="og:url" content="http://example.com/2022/04/26/%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84C_C++%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%E5%AE%9E%E7%8E%B0%E6%A8%A1%E6%9D%BF/index.html">
<meta property="og:site_name" content="夜悊的技术小宅">
<meta property="og:description" content="前言数据结构中单链表的C&#x2F;C++语言描述实现模板，有详细的步骤解析及使用示例。  代码仓库 yezhening&#x2F;Programming-examples: 编程实例 (github.com) Programming-examples: 编程实例 (gitee.com)   linkList.cpp12345678910111213141516171819202122232425">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="http://example.com/img/cover20.png">
<meta property="article:published_time" content="2022-04-26T03:13:55.000Z">
<meta property="article:modified_time" content="2023-04-12T05:27:54.141Z">
<meta property="article:author" content="夜悊">
<meta property="article:tag" content="数据结构">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="http://example.com/img/cover20.png"><link rel="shortcut icon" href="/img/favicon2.png"><link rel="canonical" href="http://example.com/2022/04/26/%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84C_C++%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%E5%AE%9E%E7%8E%B0%E6%A8%A1%E6%9D%BF/index.html"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css?v=4.13.0"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free@6.5.1/css/all.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/ui@5.0.33/dist/fancybox/fancybox.min.css" media="print" onload="this.media='all'"><script>const GLOBAL_CONFIG = {
  root: '/',
  algolia: undefined,
  localSearch: {"path":"/search.xml","preload":true,"top_n_per_article":1,"unescape":false,"languages":{"hits_empty":"找不到您查询的内容：${query}","hits_stats":"共找到 ${hits} 篇文章"}},
  translate: {"defaultEncoding":2,"translateDelay":0,"msgToTraditionalChinese":"繁","msgToSimplifiedChinese":"簡"},
  noticeOutdate: undefined,
  highlight: {"plugin":"highlight.js","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false},
  copy: {
    success: '复制成功',
    error: '复制错误',
    noSupport: '浏览器不支持'
  },
  relativeDate: {
    homepage: false,
    post: false
  },
  runtime: '天',
  dateSuffix: {
    just: '刚刚',
    min: '分钟前',
    hour: '小时前',
    day: '天前',
    month: '个月前'
  },
  copyright: {"limitCount":50,"languages":{"author":"作者: 夜悊","link":"链接: ","source":"来源: 夜悊的技术小宅","info":"著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。"}},
  lightbox: 'fancybox',
  Snackbar: undefined,
  infinitegrid: {
    js: 'https://cdn.jsdelivr.net/npm/@egjs/infinitegrid@4.11.1/dist/infinitegrid.min.js',
    buttonText: '加载更多'
  },
  isPhotoFigcaption: false,
  islazyload: true,
  isAnchor: false,
  percent: {
    toc: true,
    rightside: false,
  },
  autoDarkmode: false
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
  title: '单链表的C_C++语言描述实现模板',
  isPost: true,
  isHome: false,
  isHighlightShrink: false,
  isToc: true,
  postUpdate: '2023-04-12 13:27:54'
}</script><script>(win=>{
      win.saveToLocal = {
        set: (key, value, ttl) => {
          if (ttl === 0) return
          const now = Date.now()
          const expiry = now + ttl * 86400000
          const item = {
            value,
            expiry
          }
          localStorage.setItem(key, JSON.stringify(item))
        },
      
        get: key => {
          const itemStr = localStorage.getItem(key)
      
          if (!itemStr) {
            return undefined
          }
          const item = JSON.parse(itemStr)
          const now = Date.now()
      
          if (now > item.expiry) {
            localStorage.removeItem(key)
            return undefined
          }
          return item.value
        }
      }
    
      win.getScript = (url, attr = {}) => new Promise((resolve, reject) => {
        const script = document.createElement('script')
        script.src = url
        script.async = true
        script.onerror = reject
        script.onload = script.onreadystatechange = function() {
          const loadState = this.readyState
          if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
          script.onload = script.onreadystatechange = null
          resolve()
        }

        Object.keys(attr).forEach(key => {
          script.setAttribute(key, attr[key])
        })

        document.head.appendChild(script)
      })
    
      win.getCSS = (url, id = false) => new Promise((resolve, reject) => {
        const link = document.createElement('link')
        link.rel = 'stylesheet'
        link.href = url
        if (id) link.id = id
        link.onerror = reject
        link.onload = link.onreadystatechange = function() {
          const loadState = this.readyState
          if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
          link.onload = link.onreadystatechange = null
          resolve()
        }
        document.head.appendChild(link)
      })
    
      win.activateDarkMode = () => {
        document.documentElement.setAttribute('data-theme', 'dark')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
        }
      }
      win.activateLightMode = () => {
        document.documentElement.setAttribute('data-theme', 'light')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
        }
      }
      const t = saveToLocal.get('theme')
    
        if (t === 'dark') activateDarkMode()
        else if (t === 'light') activateLightMode()
      
      const asideStatus = saveToLocal.get('aside-status')
      if (asideStatus !== undefined) {
        if (asideStatus === 'hide') {
          document.documentElement.classList.add('hide-aside')
        } else {
          document.documentElement.classList.remove('hide-aside')
        }
      }
    
      const detectApple = () => {
        if(/iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)){
          document.documentElement.classList.add('apple')
        }
      }
      detectApple()
    })(window)</script><link rel="stylesheet" href="/css/my_css.css"><meta name="generator" content="Hexo 7.3.0"></head><body><div id="web_bg"></div><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src= "" data-lazy-src="/img/avatar.png" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="sidebar-site-data site-data is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">92</div></a><a href="/tags/"><div class="headline">标签</div><div class="length-num">15</div></a><a href="/categories/"><div class="headline">分类</div><div class="length-num">15</div></a></div><hr class="custom-hr"/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 主页</span></a></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-bookmark"></i><span> 笔记目录</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/categories/"><i class="fa-fw fa fa-folder-open"></i><span> 分类</span></a></li><li><a class="site-page child" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> 标签</span></a></li><li><a class="site-page child" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> 归档</span></a></li></ul></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-blog"></i><span> 其他博客</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener" href="https://blog.csdn.net/m0_62083249"><i class="fa-fw fa fa-link"></i><span> CSDN</span></a></li><li><a class="site-page child" target="_blank" rel="noopener" href="https://www.zhihu.com/people/ye-zhe-ning"><i class="fa-fw fa fa-link"></i><span> 知乎</span></a></li></ul></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-sitemap"></i><span> 代码仓库</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener" href="https://gitee.com/yezhening"><i class="fa-fw fa fa-link"></i><span> Gitee</span></a></li><li><a class="site-page child" target="_blank" rel="noopener" href="https://github.com/yezhening"><i class="fa-fw fa fa-link"></i><span> Github</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/about_me/"><i class="fa-fw fas fa-user"></i><span> 关于我</span></a></div></div></div></div><div class="post" id="body-wrap"><header class="post-bg" id="page-header" style="background-image: url('/img/cover20.png')"><nav id="nav"><span id="blog-info"><a href="/" title="夜悊的技术小宅"><span class="site-name">夜悊的技术小宅</span></a></span><div id="menus"><div id="search-button"><a class="site-page social-icon search" href="javascript:void(0);"><i class="fas fa-search fa-fw"></i><span> 搜索</span></a></div><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 主页</span></a></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-bookmark"></i><span> 笔记目录</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/categories/"><i class="fa-fw fa fa-folder-open"></i><span> 分类</span></a></li><li><a class="site-page child" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> 标签</span></a></li><li><a class="site-page child" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> 归档</span></a></li></ul></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-blog"></i><span> 其他博客</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener" href="https://blog.csdn.net/m0_62083249"><i class="fa-fw fa fa-link"></i><span> CSDN</span></a></li><li><a class="site-page child" target="_blank" rel="noopener" href="https://www.zhihu.com/people/ye-zhe-ning"><i class="fa-fw fa fa-link"></i><span> 知乎</span></a></li></ul></div><div class="menus_item"><a class="site-page group hide" href="javascript:void(0);"><i class="fa-fw fa fa-sitemap"></i><span> 代码仓库</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" target="_blank" rel="noopener" href="https://gitee.com/yezhening"><i class="fa-fw fa fa-link"></i><span> Gitee</span></a></li><li><a class="site-page child" target="_blank" rel="noopener" href="https://github.com/yezhening"><i class="fa-fw fa fa-link"></i><span> Github</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/about_me/"><i class="fa-fw fas fa-user"></i><span> 关于我</span></a></div></div><div id="toggle-menu"><a class="site-page" href="javascript:void(0);"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="post-info"><h1 class="post-title">单链表的C_C++语言描述实现模板</h1><div id="post-meta"><div class="meta-firstline"><span class="post-meta-date"><i class="far fa-calendar-alt fa-fw post-meta-icon"></i><span class="post-meta-label">发表于</span><time class="post-meta-date-created" datetime="2022-04-26T03:13:55.000Z" title="发表于 2022-04-26 11:13:55">2022-04-26</time><span class="post-meta-separator">|</span><i class="fas fa-history fa-fw post-meta-icon"></i><span class="post-meta-label">更新于</span><time class="post-meta-date-updated" datetime="2023-04-12T05:27:54.141Z" title="更新于 2023-04-12 13:27:54">2023-04-12</time></span><span class="post-meta-categories"><span class="post-meta-separator">|</span><i class="fas fa-inbox fa-fw post-meta-icon"></i><a class="post-meta-categories" href="/categories/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">数据结构</a></span></div><div class="meta-secondline"><span class="post-meta-separator">|</span><span class="post-meta-pv-cv" id="" data-flag-title="单链表的C_C++语言描述实现模板"><i class="far fa-eye fa-fw post-meta-icon"></i><span class="post-meta-label">阅读量:</span><span id="busuanzi_value_page_pv"><i class="fa-solid fa-spinner fa-spin"></i></span></span></div></div></div></header><main class="layout" id="content-inner"><div id="post"><article class="post-content" id="article-container"><h1 id="前言"><a href="#前言" class="headerlink" title="前言"></a>前言</h1><p>数据结构中单链表的C&#x2F;C++语言描述实现模板，有详细的步骤解析及使用示例。</p>
<hr>
<h1 id="代码仓库"><a href="#代码仓库" class="headerlink" title="代码仓库"></a>代码仓库</h1><ul>
<li><a target="_blank" rel="noopener" href="https://github.com/yezhening/Programming-examples">yezhening&#x2F;Programming-examples: 编程实例 (github.com)</a></li>
<li><a target="_blank" rel="noopener" href="https://gitee.com/yezhening/Programming-examples">Programming-examples: 编程实例 (gitee.com)</a></li>
</ul>
<hr>
<h1 id="linkList-cpp"><a href="#linkList-cpp" class="headerlink" title="linkList.cpp"></a>linkList.cpp</h1><figure class="highlight cpp"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br><span class="line">171</span><br><span class="line">172</span><br><span class="line">173</span><br><span class="line">174</span><br><span class="line">175</span><br><span class="line">176</span><br><span class="line">177</span><br><span class="line">178</span><br><span class="line">179</span><br><span class="line">180</span><br><span class="line">181</span><br><span class="line">182</span><br><span class="line">183</span><br><span class="line">184</span><br><span class="line">185</span><br><span class="line">186</span><br><span class="line">187</span><br><span class="line">188</span><br><span class="line">189</span><br><span class="line">190</span><br><span class="line">191</span><br><span class="line">192</span><br><span class="line">193</span><br><span class="line">194</span><br><span class="line">195</span><br><span class="line">196</span><br><span class="line">197</span><br><span class="line">198</span><br><span class="line">199</span><br><span class="line">200</span><br><span class="line">201</span><br><span class="line">202</span><br><span class="line">203</span><br><span class="line">204</span><br><span class="line">205</span><br><span class="line">206</span><br><span class="line">207</span><br><span class="line">208</span><br><span class="line">209</span><br><span class="line">210</span><br><span class="line">211</span><br><span class="line">212</span><br><span class="line">213</span><br><span class="line">214</span><br><span class="line">215</span><br><span class="line">216</span><br><span class="line">217</span><br><span class="line">218</span><br><span class="line">219</span><br><span class="line">220</span><br><span class="line">221</span><br><span class="line">222</span><br><span class="line">223</span><br><span class="line">224</span><br><span class="line">225</span><br><span class="line">226</span><br><span class="line">227</span><br><span class="line">228</span><br><span class="line">229</span><br><span class="line">230</span><br><span class="line">231</span><br><span class="line">232</span><br><span class="line">233</span><br><span class="line">234</span><br><span class="line">235</span><br><span class="line">236</span><br><span class="line">237</span><br><span class="line">238</span><br><span class="line">239</span><br><span class="line">240</span><br><span class="line">241</span><br><span class="line">242</span><br><span class="line">243</span><br><span class="line">244</span><br><span class="line">245</span><br><span class="line">246</span><br><span class="line">247</span><br><span class="line">248</span><br><span class="line">249</span><br><span class="line">250</span><br><span class="line">251</span><br><span class="line">252</span><br><span class="line">253</span><br><span class="line">254</span><br><span class="line">255</span><br><span class="line">256</span><br><span class="line">257</span><br><span class="line">258</span><br><span class="line">259</span><br><span class="line">260</span><br><span class="line">261</span><br><span class="line">262</span><br><span class="line">263</span><br><span class="line">264</span><br><span class="line">265</span><br><span class="line">266</span><br><span class="line">267</span><br><span class="line">268</span><br><span class="line">269</span><br><span class="line">270</span><br><span class="line">271</span><br><span class="line">272</span><br><span class="line">273</span><br><span class="line">274</span><br><span class="line">275</span><br><span class="line">276</span><br><span class="line">277</span><br><span class="line">278</span><br><span class="line">279</span><br><span class="line">280</span><br><span class="line">281</span><br><span class="line">282</span><br><span class="line">283</span><br><span class="line">284</span><br><span class="line">285</span><br><span class="line">286</span><br><span class="line">287</span><br><span class="line">288</span><br><span class="line">289</span><br><span class="line">290</span><br><span class="line">291</span><br><span class="line">292</span><br><span class="line">293</span><br><span class="line">294</span><br><span class="line">295</span><br><span class="line">296</span><br><span class="line">297</span><br><span class="line">298</span><br><span class="line">299</span><br><span class="line">300</span><br><span class="line">301</span><br><span class="line">302</span><br><span class="line">303</span><br><span class="line">304</span><br><span class="line">305</span><br><span class="line">306</span><br><span class="line">307</span><br><span class="line">308</span><br><span class="line">309</span><br><span class="line">310</span><br><span class="line">311</span><br><span class="line">312</span><br><span class="line">313</span><br><span class="line">314</span><br><span class="line">315</span><br><span class="line">316</span><br><span class="line">317</span><br><span class="line">318</span><br><span class="line">319</span><br><span class="line">320</span><br><span class="line">321</span><br><span class="line">322</span><br><span class="line">323</span><br><span class="line">324</span><br><span class="line">325</span><br><span class="line">326</span><br><span class="line">327</span><br><span class="line">328</span><br><span class="line">329</span><br><span class="line">330</span><br><span class="line">331</span><br><span class="line">332</span><br><span class="line">333</span><br><span class="line">334</span><br><span class="line">335</span><br><span class="line">336</span><br><span class="line">337</span><br><span class="line">338</span><br><span class="line">339</span><br><span class="line">340</span><br><span class="line">341</span><br><span class="line">342</span><br><span class="line">343</span><br><span class="line">344</span><br><span class="line">345</span><br><span class="line">346</span><br><span class="line">347</span><br><span class="line">348</span><br><span class="line">349</span><br><span class="line">350</span><br><span class="line">351</span><br><span class="line">352</span><br><span class="line">353</span><br><span class="line">354</span><br><span class="line">355</span><br><span class="line">356</span><br><span class="line">357</span><br><span class="line">358</span><br><span class="line">359</span><br><span class="line">360</span><br><span class="line">361</span><br><span class="line">362</span><br><span class="line">363</span><br><span class="line">364</span><br><span class="line">365</span><br><span class="line">366</span><br><span class="line">367</span><br><span class="line">368</span><br><span class="line">369</span><br><span class="line">370</span><br><span class="line">371</span><br><span class="line">372</span><br><span class="line">373</span><br><span class="line">374</span><br><span class="line">375</span><br><span class="line">376</span><br><span class="line">377</span><br><span class="line">378</span><br><span class="line">379</span><br><span class="line">380</span><br><span class="line">381</span><br><span class="line">382</span><br><span class="line">383</span><br><span class="line">384</span><br><span class="line">385</span><br><span class="line">386</span><br><span class="line">387</span><br><span class="line">388</span><br><span class="line">389</span><br><span class="line">390</span><br><span class="line">391</span><br><span class="line">392</span><br><span class="line">393</span><br><span class="line">394</span><br><span class="line">395</span><br><span class="line">396</span><br><span class="line">397</span><br><span class="line">398</span><br><span class="line">399</span><br><span class="line">400</span><br><span class="line">401</span><br><span class="line">402</span><br><span class="line">403</span><br><span class="line">404</span><br><span class="line">405</span><br><span class="line">406</span><br><span class="line">407</span><br><span class="line">408</span><br><span class="line">409</span><br><span class="line">410</span><br><span class="line">411</span><br><span class="line">412</span><br><span class="line">413</span><br><span class="line">414</span><br><span class="line">415</span><br><span class="line">416</span><br><span class="line">417</span><br><span class="line">418</span><br><span class="line">419</span><br><span class="line">420</span><br><span class="line">421</span><br><span class="line">422</span><br><span class="line">423</span><br><span class="line">424</span><br><span class="line">425</span><br><span class="line">426</span><br><span class="line">427</span><br><span class="line">428</span><br><span class="line">429</span><br><span class="line">430</span><br><span class="line">431</span><br><span class="line">432</span><br><span class="line">433</span><br><span class="line">434</span><br><span class="line">435</span><br><span class="line">436</span><br><span class="line">437</span><br><span class="line">438</span><br><span class="line">439</span><br><span class="line">440</span><br><span class="line">441</span><br><span class="line">442</span><br><span class="line">443</span><br><span class="line">444</span><br><span class="line">445</span><br><span class="line">446</span><br><span class="line">447</span><br><span class="line">448</span><br><span class="line">449</span><br><span class="line">450</span><br><span class="line">451</span><br><span class="line">452</span><br><span class="line">453</span><br><span class="line">454</span><br><span class="line">455</span><br><span class="line">456</span><br><span class="line">457</span><br><span class="line">458</span><br><span class="line">459</span><br><span class="line">460</span><br><span class="line">461</span><br><span class="line">462</span><br><span class="line">463</span><br><span class="line">464</span><br><span class="line">465</span><br><span class="line">466</span><br><span class="line">467</span><br><span class="line">468</span><br><span class="line">469</span><br><span class="line">470</span><br><span class="line">471</span><br><span class="line">472</span><br><span class="line">473</span><br><span class="line">474</span><br><span class="line">475</span><br><span class="line">476</span><br><span class="line">477</span><br><span class="line">478</span><br><span class="line">479</span><br><span class="line">480</span><br><span class="line">481</span><br><span class="line">482</span><br><span class="line">483</span><br><span class="line">484</span><br><span class="line">485</span><br><span class="line">486</span><br><span class="line">487</span><br><span class="line">488</span><br><span class="line">489</span><br><span class="line">490</span><br><span class="line">491</span><br><span class="line">492</span><br><span class="line">493</span><br><span class="line">494</span><br><span class="line">495</span><br><span class="line">496</span><br><span class="line">497</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">//头文件————————————————————</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;iostream&gt;</span></span></span><br><span class="line"><span class="keyword">using</span> <span class="keyword">namespace</span> std;</span><br><span class="line"></span><br><span class="line"><span class="comment">//自定义数据类型————————————————————</span></span><br><span class="line"><span class="keyword">typedef</span> <span class="type">int</span> ELEM_TYPE; <span class="comment">//数据的（数据）类型 依据数据的实际类型定义</span></span><br><span class="line"></span><br><span class="line"><span class="comment">//结构体</span></span><br><span class="line"><span class="comment">//定义</span></span><br><span class="line"><span class="comment">//结点</span></span><br><span class="line"><span class="keyword">typedef</span> <span class="keyword">struct</span> <span class="title class_">LNode</span></span><br><span class="line">&#123;</span><br><span class="line">    ELEM_TYPE data;     <span class="comment">//数据</span></span><br><span class="line">    <span class="keyword">struct</span> <span class="title class_">LNode</span> *next; <span class="comment">//指向直接后继结点的指针</span></span><br><span class="line">&#125; LNode;</span><br><span class="line"><span class="comment">// struct LNode：结构体数据类型的名称</span></span><br><span class="line"><span class="comment">//如创建一个结点的语句：struct LNode node;</span></span><br><span class="line"><span class="comment">//若结构体数据类型内存在指向该结构体的指针数据类型，则必须完整命名结构体数据类型的名称</span></span><br><span class="line"><span class="comment">//如结点结构体LNode内存在指向该结构体的指针数据类型next，则命名语句为：typedef struct LNode而不是typedef struct</span></span><br><span class="line"><span class="comment">// LNode：typedef给结构体数据类型起的别名，可简化语句</span></span><br><span class="line"><span class="comment">//如创建一个结点的语句：LNode node;</span></span><br><span class="line"><span class="comment">//结构体数据类型的名称和别名尽量一致，以方便记忆、使用</span></span><br><span class="line"></span><br><span class="line"><span class="comment">//函数声明————————————————————</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">use_example</span><span class="params">()</span></span>;                                                  <span class="comment">//使用示例</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">create_list_head</span><span class="params">(LNode *&amp;head, ELEM_TYPE value[], <span class="type">int</span> count)</span></span>;   <span class="comment">//创建  头插法</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">create_list_tail</span><span class="params">(LNode *&amp;head, ELEM_TYPE value[], <span class="type">int</span> count)</span></span>;   <span class="comment">//创建  尾插法</span></span><br><span class="line"><span class="function">LNode *<span class="title">find_node</span><span class="params">(LNode *head, ELEM_TYPE elem)</span></span>;                       <span class="comment">//按值查找</span></span><br><span class="line"><span class="function">LNode *<span class="title">get_node</span><span class="params">(LNode *head, <span class="type">int</span> i)</span></span>;                                 <span class="comment">//按序查找</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">insert_node</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi, LNode *node)</span></span>;               <span class="comment">//插入  前插</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">insert_node_exten</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi, LNode *node)</span></span>;         <span class="comment">//插入  扩展：前插转后插</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">delele_node</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi)</span></span>;                            <span class="comment">//删除  前删</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">delele_node_exten</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi)</span></span>;                      <span class="comment">//删除  前删转后删</span></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">get_length</span><span class="params">(LNode *head)</span></span>;                                         <span class="comment">//获取表长</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">clear_list</span><span class="params">(LNode *&amp;head)</span></span>;                                       <span class="comment">//清空</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge_list_increase</span><span class="params">(LNode *head1, LNode *head2, LNode *&amp;head3)</span></span>; <span class="comment">//合并两递增表成递增表</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge_list_reduce</span><span class="params">(LNode *head1, LNode *head2, LNode *&amp;head3)</span></span>;   <span class="comment">//合并两递增表成递减表</span></span><br><span class="line"></span><br><span class="line"><span class="comment">//主函数————————————————————</span></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">main</span><span class="params">()</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    <span class="built_in">use_example</span>(); <span class="comment">//使用示例</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//函数定义————————————————————</span></span><br><span class="line"><span class="comment">//使用示例</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">use_example</span><span class="params">()</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    <span class="comment">//创建</span></span><br><span class="line">    <span class="keyword">struct</span> <span class="title class_">LNode</span> *head; <span class="comment">//头指针，指向头结点或第一个结点</span></span><br><span class="line">    <span class="comment">//或LNode *head;</span></span><br><span class="line">    <span class="comment">//一般头指针变量名为链表表名    这里用head见明知意，表示是头指针</span></span><br><span class="line"></span><br><span class="line">    ELEM_TYPE value[<span class="number">3</span>]; <span class="comment">//数据数组</span></span><br><span class="line">    value[<span class="number">0</span>] = <span class="number">100</span>;</span><br><span class="line">    value[<span class="number">1</span>] = <span class="number">200</span>;</span><br><span class="line">    value[<span class="number">2</span>] = <span class="number">300</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">create_list_tail</span>(head, value, <span class="number">3</span>); <span class="comment">//创建    尾插法  元素在表中的排列：100，200，300</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//按值查找</span></span><br><span class="line">    LNode *node; <span class="comment">//结点指针</span></span><br><span class="line"></span><br><span class="line">    node = <span class="built_in">find_node</span>(head, <span class="number">100</span>); <span class="comment">//按值查找</span></span><br><span class="line"></span><br><span class="line">    cout &lt;&lt; node-&gt;data &lt;&lt; endl; <span class="comment">//输出：100</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//按序查找</span></span><br><span class="line">    node = <span class="built_in">get_node</span>(head, <span class="number">2</span>); <span class="comment">//按序查找</span></span><br><span class="line"></span><br><span class="line">    cout &lt;&lt; node-&gt;data &lt;&lt; endl; <span class="comment">//输出：200</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//插入  前插</span></span><br><span class="line">    node = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建新结点   结点指针指向新结点</span></span><br><span class="line">    node-&gt;data = <span class="number">400</span>;                      <span class="comment">//初始化新结点的数据域</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">insert_node</span>(head, <span class="number">3</span>, node); <span class="comment">//插入 前插 元素在表中的排列：100，200，400，300</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//插入  扩展：前插转后插</span></span><br><span class="line">    node = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建新结点   结点指针指向新结点</span></span><br><span class="line">    node-&gt;data = <span class="number">500</span>;                      <span class="comment">//初始化新结点的数据域</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">insert_node_exten</span>(head, <span class="number">3</span>, node); <span class="comment">//插入    扩展：前插转后插    元素在表中的排列：100，200，500，400，300</span></span><br><span class="line"></span><br><span class="line">    LNode *p;       <span class="comment">//移动结点指针</span></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化移动结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line">        cout &lt;&lt; p-&gt;data &lt;&lt; endl; <span class="comment">//输出：100，200，500，400，300</span></span><br><span class="line"></span><br><span class="line">        p = p-&gt;next; <span class="comment">//移动结点指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">//删除  前删</span></span><br><span class="line">    <span class="built_in">delele_node</span>(head, <span class="number">3</span>); <span class="comment">//删除  前删  元素在表中的排列：100，200，400，300</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//删除  前删转后删</span></span><br><span class="line">    <span class="built_in">delele_node_exten</span>(head, <span class="number">3</span>); <span class="comment">//删除  前删转后删  元素在表中的排列：100，200，300</span></span><br><span class="line"></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化移动结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line">        cout &lt;&lt; p-&gt;data &lt;&lt; endl; <span class="comment">//输出：100，200，300</span></span><br><span class="line"></span><br><span class="line">        p = p-&gt;next; <span class="comment">//移动结点指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">//获取表长</span></span><br><span class="line">    <span class="type">int</span> list_length = <span class="number">0</span>; <span class="comment">//表长</span></span><br><span class="line"></span><br><span class="line">    list_length = <span class="built_in">get_length</span>(head);</span><br><span class="line"></span><br><span class="line">    cout &lt;&lt; list_length &lt;&lt; endl; <span class="comment">//输出：3</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//清空</span></span><br><span class="line">    <span class="built_in">clear_list</span>(head);</span><br><span class="line"></span><br><span class="line">    list_length = <span class="built_in">get_length</span>(head);</span><br><span class="line"></span><br><span class="line">    cout &lt;&lt; list_length &lt;&lt; endl; <span class="comment">//输出：0</span></span><br><span class="line"></span><br><span class="line">    <span class="comment">//合并两递增表成递增表</span></span><br><span class="line">    <span class="keyword">struct</span> <span class="title class_">LNode</span> *head1; <span class="comment">//递增表1的头指针，指向头结点或第一个结点</span></span><br><span class="line"></span><br><span class="line">    ELEM_TYPE value1[<span class="number">3</span>]; <span class="comment">//数据数组1</span></span><br><span class="line">    value1[<span class="number">0</span>] = <span class="number">100</span>;</span><br><span class="line">    value1[<span class="number">1</span>] = <span class="number">300</span>;</span><br><span class="line">    value1[<span class="number">2</span>] = <span class="number">500</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">create_list_tail</span>(head1, value1, <span class="number">3</span>); <span class="comment">//创建    尾插法  元素在表中的排列：100，300，500</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">struct</span> <span class="title class_">LNode</span> *head2; <span class="comment">//递增表2的头指针，指向头结点或第一个结点</span></span><br><span class="line"></span><br><span class="line">    ELEM_TYPE value2[<span class="number">3</span>]; <span class="comment">//数据数组2</span></span><br><span class="line">    value2[<span class="number">0</span>] = <span class="number">200</span>;</span><br><span class="line">    value2[<span class="number">1</span>] = <span class="number">400</span>;</span><br><span class="line">    value2[<span class="number">2</span>] = <span class="number">600</span>;</span><br><span class="line"></span><br><span class="line">    <span class="built_in">create_list_tail</span>(head2, value2, <span class="number">3</span>); <span class="comment">//创建    尾插法  元素在表中的排列：200，400，600</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">struct</span> <span class="title class_">LNode</span> *head3; <span class="comment">//新递增表的头指针，指向头结点或第一个结点</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">merge_list_increase</span>(head1, head2, head3); <span class="comment">//合并两递增表成递增表</span></span><br><span class="line"></span><br><span class="line">    p = head3-&gt;next;  <span class="comment">//移动结点指针    指向新递增表的第一个结点</span></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line">        cout &lt;&lt; p-&gt;data &lt;&lt; endl; <span class="comment">//输出：100，200，300，400，500，600</span></span><br><span class="line"></span><br><span class="line">        p = p-&gt;next; <span class="comment">//移动结点指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="comment">//合并两递增表成递减少表</span></span><br><span class="line">    <span class="built_in">create_list_tail</span>(head1, value1, <span class="number">3</span>); <span class="comment">//创建    尾插法  元素在表中的排列：100，300，500</span></span><br><span class="line">    <span class="built_in">create_list_tail</span>(head2, value2, <span class="number">3</span>); <span class="comment">//创建    尾插法  元素在表中的排列：200，400，600</span></span><br><span class="line">    <span class="built_in">clear_list</span>(head3);                  <span class="comment">//清空</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">merge_list_reduce</span>(head1, head2, head3); <span class="comment">//合并两递增表成递减表</span></span><br><span class="line"></span><br><span class="line">    p = head3-&gt;next;  <span class="comment">//移动结点指针    指向新递减表的第一个结点</span></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line">        cout &lt;&lt; p-&gt;data &lt;&lt; endl; <span class="comment">//输出：600，500，400，300，200，100</span></span><br><span class="line"></span><br><span class="line">        p = p-&gt;next; <span class="comment">//移动结点指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//函数定义————————————————————</span></span><br><span class="line"><span class="comment">//创建  头插法</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="comment">//注意：参数使用*&amp;，指向指针的引用数据类型</span></span><br><span class="line"><span class="comment">//若只使用*，指针数据类型，在函数体中并未进行解引用调用修改*head的值，使用malloc()修改的是head的值</span></span><br><span class="line"><span class="comment">//所以是值拷贝，函数返回后数据丢失。地址拷贝需要引用数据类型的配合</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">create_list_head</span><span class="params">(LNode *&amp;head, ELEM_TYPE value[], <span class="type">int</span> count)</span> <span class="comment">//参数：头指针，数据数组，数据数量</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    head = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建头结点，头指针指向头结点</span></span><br><span class="line">    head-&gt;next = <span class="literal">NULL</span>;                     <span class="comment">//初始化头结点的指针域</span></span><br><span class="line"></span><br><span class="line">    LNode *node; <span class="comment">//新结点指针</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; count; i++) <span class="comment">//循环创建链表</span></span><br><span class="line">    &#123;</span><br><span class="line">        node = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建新结点，新结点指针指向新结点</span></span><br><span class="line">        node-&gt;data = value[i];                 <span class="comment">//初始化新结点的数据域</span></span><br><span class="line"></span><br><span class="line">        node-&gt;next = head-&gt;next; <span class="comment">//初始化新结点的指针域</span></span><br><span class="line">        head-&gt;next = node;</span><br><span class="line">        <span class="comment">//插入到链表的头结点和前一新结点之间</span></span><br><span class="line">        <span class="comment">//链表描述：头结点-&gt;当前新结点-&gt;前一新结点-&gt;...-&gt;空</span></span><br><span class="line">        <span class="comment">//若无头结点：head=node;</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//创建  尾插法</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">create_list_tail</span><span class="params">(LNode *&amp;head, ELEM_TYPE value[], <span class="type">int</span> count)</span> <span class="comment">//参数：头指针，数据数组，数据数量</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    head = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建头结点，头指针指向头结点</span></span><br><span class="line">    head-&gt;next = <span class="literal">NULL</span>;                     <span class="comment">//初始化头结点的指针域</span></span><br><span class="line"></span><br><span class="line">    LNode *tail; <span class="comment">//尾指针，尾指针始终指向最后一个结点</span></span><br><span class="line">    tail = head; <span class="comment">//初始化尾指针  指向最后一个结点（头结点）</span></span><br><span class="line"></span><br><span class="line">    LNode *node; <span class="comment">//新结点指针</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> i = <span class="number">0</span>; i &lt; count; i++) <span class="comment">//循环创建链表</span></span><br><span class="line">    &#123;</span><br><span class="line">        node = (LNode *)<span class="built_in">malloc</span>(<span class="built_in">sizeof</span>(LNode)); <span class="comment">//创建新结点，新结点指针指向新结点</span></span><br><span class="line">        node-&gt;data = value[i];                 <span class="comment">//初始化新结点的数据域</span></span><br><span class="line"></span><br><span class="line">        tail-&gt;next = node; <span class="comment">//插入到链表的头结点和前一新结点之间</span></span><br><span class="line">        tail = tail-&gt;next; <span class="comment">//移动尾指针</span></span><br><span class="line">        <span class="comment">//或者tail=node;</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    tail-&gt;next = <span class="literal">NULL</span>; <span class="comment">//尾指针指向空   创建完成</span></span><br><span class="line">    <span class="comment">//链表描述：头结点-&gt;...-&gt;前一新结点-&gt;当前新结点-&gt;空</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//按值查找</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="function">LNode *<span class="title">find_node</span><span class="params">(LNode *head, ELEM_TYPE elem)</span> <span class="comment">//参数：头指针，元素  返回值：结点指针</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;       <span class="comment">//移动结点指针</span></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化移动结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">if</span> (p-&gt;data == elem) <span class="comment">//匹配</span></span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">break</span>; <span class="comment">//退出查找</span></span><br><span class="line">        &#125;</span><br><span class="line"></span><br><span class="line">        p = p-&gt;next; <span class="comment">//若不匹配，移动结点指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> p; <span class="comment">//若找到返回结点指针，否则返回空指针</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//按序查找</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="function">LNode *<span class="title">get_node</span><span class="params">(LNode *head, <span class="type">int</span> i)</span> <span class="comment">//参数：头指针，元素查找的位置   返回值：结点指针</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;       <span class="comment">//移动结点指针</span></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化移动结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (i &lt; <span class="number">0</span>) <span class="comment">//不存在负数的位置</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span> <span class="literal">NULL</span>; <span class="comment">//返回空指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (i == <span class="number">0</span>) <span class="comment">//第0个位置是头结点</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">return</span> head; <span class="comment">//返回头指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">for</span> (<span class="type">int</span> j = <span class="number">1</span>; j &lt; i; j++) <span class="comment">//遍历</span></span><br><span class="line">    &#123;</span><br><span class="line"></span><br><span class="line">        <span class="keyword">if</span> (p != <span class="literal">NULL</span>) <span class="comment">//不匹配</span></span><br><span class="line">        &#123;</span><br><span class="line">            p = p-&gt;next; <span class="comment">//移动结点指针</span></span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="comment">//匹配</span></span><br><span class="line">        &#123;</span><br><span class="line">            <span class="keyword">break</span>; <span class="comment">//退出查找</span></span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> p; <span class="comment">//若找到返回结点指针，否则返回空指针</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//插入  前插</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="comment">//因为需遍历找到元素插入位置之前的结点</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">insert_node</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi, LNode *node)</span> <span class="comment">//参数：头指针，元素插入的位置，结点</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;                     <span class="comment">//移动结点指针</span></span><br><span class="line">    p = <span class="built_in">get_node</span>(head, posi - <span class="number">1</span>); <span class="comment">//初始化移动结点指针 指向第posi-1个位置的结点</span></span><br><span class="line"></span><br><span class="line">    node-&gt;next = p-&gt;next; <span class="comment">//插入 在第posi-1个位置的结点之后，占据第posi个位置，在原第posi个位置的结点之前</span></span><br><span class="line">    p-&gt;next = node;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//插入  扩展：前插转后插</span></span><br><span class="line"><span class="comment">//时间复杂度：O(1)</span></span><br><span class="line"><span class="comment">//直接在元素插入位置之后的结点插入，再交换结点数据</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">insert_node_exten</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi, LNode *node)</span> <span class="comment">//参数：头指针，元素插入的位置，结点</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;                 <span class="comment">//移动结点指针</span></span><br><span class="line">    p = <span class="built_in">get_node</span>(head, posi); <span class="comment">//初始化移动结点指针 指向第posi个位置的结点</span></span><br><span class="line"></span><br><span class="line">    node-&gt;next = p-&gt;next; <span class="comment">//插入 在第posi个位置的结点之后</span></span><br><span class="line">    p-&gt;next = node;</span><br><span class="line"></span><br><span class="line">    ELEM_TYPE temp; <span class="comment">//临时数据</span></span><br><span class="line"></span><br><span class="line">    temp = p-&gt;data; <span class="comment">//交换第posi个位置的结点和新结点的数据</span></span><br><span class="line">    p-&gt;data = node-&gt;data;</span><br><span class="line">    node-&gt;data = temp;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//删除  前删</span></span><br><span class="line"><span class="comment">//时间复杂度：O(n)</span></span><br><span class="line"><span class="comment">//因为需遍历找到元素删除位置之前的结点</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">delele_node</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi)</span> <span class="comment">//参数：头指针，元素删除的位置</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;                     <span class="comment">//移动结点指针</span></span><br><span class="line">    p = <span class="built_in">get_node</span>(head, posi - <span class="number">1</span>); <span class="comment">//初始化移动结点指针 指向第posi-1个位置的结点</span></span><br><span class="line"></span><br><span class="line">    LNode *q;    <span class="comment">//被删结点指针</span></span><br><span class="line">    q = p-&gt;next; <span class="comment">//初始化被删结点指针 指向第posi个位置的结点</span></span><br><span class="line"></span><br><span class="line">    p-&gt;next = q-&gt;next; <span class="comment">//修改指针指向   第posi-1个位置的结点的指针指向第posi+1个位置的结点</span></span><br><span class="line">    <span class="comment">//或者p-&gt;next=p-&gt;next-&gt;next;</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">free</span>(q); <span class="comment">//删除被删结点指针指向的结点，释放内存</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//删除  前删转后删</span></span><br><span class="line"><span class="comment">//时间复杂度：O(1)</span></span><br><span class="line"><span class="comment">//交换结点数据，直接删除元素删除位置之后的结点</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">delele_node_exten</span><span class="params">(LNode *&amp;head, <span class="type">int</span> posi)</span> <span class="comment">//参数：头指针，元素删除的位置</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;                 <span class="comment">//移动结点指针</span></span><br><span class="line">    p = <span class="built_in">get_node</span>(head, posi); <span class="comment">//初始化移动结点指针 指向第posi个位置的结点</span></span><br><span class="line"></span><br><span class="line">    LNode *q;    <span class="comment">//被删结点指针</span></span><br><span class="line">    q = p-&gt;next; <span class="comment">//初始化被删结点指针 指向第posi+1个位置的结点</span></span><br><span class="line"></span><br><span class="line">    p-&gt;data = q-&gt;data; <span class="comment">//交换第posi个位置和第posi+1个位置结点的数据 此时需删除的是第posi+1个位置的结点</span></span><br><span class="line">    <span class="comment">//或者p-&gt;data=p-&gt;next-&gt;data</span></span><br><span class="line">    p-&gt;next = q-&gt;next; <span class="comment">//修改指针指向   第posi个位置的结点的指针指向第posi+2个位置的结点</span></span><br><span class="line">    <span class="comment">//或者p-&gt;next=p-&gt;next-&gt;next;</span></span><br><span class="line"></span><br><span class="line">    <span class="built_in">free</span>(q); <span class="comment">//删除被删结点指针指向的结点，释放内存</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//获取表长</span></span><br><span class="line"><span class="function"><span class="type">int</span> <span class="title">get_length</span><span class="params">(LNode *head)</span> <span class="comment">//参数：头指针  返回值：表长</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;       <span class="comment">//移动结点指针</span></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化移动结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    <span class="type">int</span> length = <span class="number">0</span>; <span class="comment">//表长</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历 有结点</span></span><br><span class="line">    &#123;</span><br><span class="line">        length++;    <span class="comment">//表长递增</span></span><br><span class="line">        p = p-&gt;next; <span class="comment">//移动指针</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span> length; <span class="comment">//返回表长</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//清空</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">clear_list</span><span class="params">(LNode *&amp;head)</span> <span class="comment">//参数：头指针</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;       <span class="comment">//被删结点指针</span></span><br><span class="line">    p = head-&gt;next; <span class="comment">//初始化被删结点指针 指向第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    LNode *q; <span class="comment">//记录结点指针 指向被删结点的下一个结点</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> (p != <span class="literal">NULL</span>) <span class="comment">//遍历    有结点</span></span><br><span class="line">    &#123;</span><br><span class="line">        q = p-&gt;next; <span class="comment">//记录被删结点的下一个结点</span></span><br><span class="line"></span><br><span class="line">        <span class="built_in">free</span>(p); <span class="comment">//删除被删结点指针指向的结点，释放内存</span></span><br><span class="line"></span><br><span class="line">        p = q; <span class="comment">//移动指针    指向下一个被删结点</span></span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    head-&gt;next = <span class="literal">NULL</span>; <span class="comment">//头结点的指针域置空 当退出遍历时已无数据结点</span></span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//合并两递增表成递增表</span></span><br><span class="line"><span class="comment">//思路：遍历两递增表，比较结点的数值域数据，使用尾插法创建新递增表</span></span><br><span class="line"><span class="comment">//参数：递增表1的头指针，递增表2的头指针，新递增表的头指针</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge_list_increase</span><span class="params">(LNode *head1, LNode *head2, LNode *&amp;head3)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;        <span class="comment">//移动结点指针1</span></span><br><span class="line">    p = head1-&gt;next; <span class="comment">//初始化移动结点指针1 指向递增表1的第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    LNode *q;        <span class="comment">//移动结点指针2</span></span><br><span class="line">    q = head2-&gt;next; <span class="comment">//初始化移动结点指针2 指向递增表2的第一个结点（头结点的下一个结点）</span></span><br><span class="line">    <span class="built_in">free</span>(head2);     <span class="comment">//释放递增表2的头结点  因为已用移动结点指针2记录递增表2的第一个结点，数据不会丢失</span></span><br><span class="line"></span><br><span class="line">    head3 = head1;      <span class="comment">//初始化新递增表的头指针 指向递增表1的头结点，用递增表1的头结点作为新递增表的头结点</span></span><br><span class="line">    head3-&gt;next = <span class="literal">NULL</span>; <span class="comment">//初始化新递增表头结点的指针域，置空  因为已用移动结点指针1记录递增表1的第一个结点，数据不会丢失</span></span><br><span class="line"></span><br><span class="line">    LNode *tail;  <span class="comment">//新递增表的尾指针    始终指向新递增表的终端结点</span></span><br><span class="line">    tail = head3; <span class="comment">//初始化新递增表的尾指针  初始时新递增表为空，尾指针指向头结点</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> ((p != <span class="literal">NULL</span>) &amp;&amp; (q != <span class="literal">NULL</span>)) <span class="comment">//遍历两递增表</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">if</span> (p-&gt;data &lt;= q-&gt;data) <span class="comment">//比较结点的数值域数据</span></span><br><span class="line">        &#123;</span><br><span class="line">            tail-&gt;next = p; <span class="comment">//将数据域数值小的结点插入新递增表表尾</span></span><br><span class="line"></span><br><span class="line">            p = p-&gt;next;       <span class="comment">//递增表1的当前结点已插入新递增表，更新移动结点指针1</span></span><br><span class="line">            tail = tail-&gt;next; <span class="comment">//更新新递增表的尾指针  始终指向新递增表的终端结点</span></span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="comment">//同理</span></span><br><span class="line">        &#123;</span><br><span class="line">            tail-&gt;next = q;</span><br><span class="line"></span><br><span class="line">            q = q-&gt;next;</span><br><span class="line">            tail = tail-&gt;next;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    tail-&gt;next = <span class="literal">NULL</span>;</span><br><span class="line">    <span class="comment">//可以没有，因为最后还要将未插入的结点插入新递增表表尾，未插入结点的终端结点指针域为空</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (p != <span class="literal">NULL</span>) <span class="comment">//若递增表2插入完成，递增表1还有未插入结点，则将剩余结点插入新递增表尾部</span></span><br><span class="line">    &#123;</span><br><span class="line">        tail-&gt;next = p;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">if</span> (q != <span class="literal">NULL</span>) <span class="comment">//若递增表1合并完成，递增表2还有未插入结点，则将剩余结点插入新递增表尾部</span></span><br><span class="line">    &#123;</span><br><span class="line">        tail-&gt;next = q;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="comment">//合并两递增表成递减表</span></span><br><span class="line"><span class="comment">//思路：遍历两递增表，比较结点的数值域数据，使用头插法创建新递减表</span></span><br><span class="line"><span class="comment">//参数：递增表1的头指针，递增表2的头指针，新递增表的头指针</span></span><br><span class="line"><span class="function"><span class="type">void</span> <span class="title">merge_list_reduce</span><span class="params">(LNode *head1, LNode *head2, LNode *&amp;head3)</span></span></span><br><span class="line"><span class="function"></span>&#123;</span><br><span class="line">    LNode *p;        <span class="comment">//移动结点指针1</span></span><br><span class="line">    p = head1-&gt;next; <span class="comment">//初始化移动结点指针1 指向递增表1的第一个结点（头结点的下一个结点）</span></span><br><span class="line"></span><br><span class="line">    LNode *q;        <span class="comment">//移动结点指针2</span></span><br><span class="line">    q = head2-&gt;next; <span class="comment">//初始化移动结点指针2 指向递增表2的第一个结点（头结点的下一个结点）</span></span><br><span class="line">    <span class="built_in">free</span>(head2);     <span class="comment">//释放递增表2的头结点  因为已用移动结点指针2记录递增表2的第一个结点，数据不会丢失</span></span><br><span class="line"></span><br><span class="line">    head3 = head1;      <span class="comment">//初始化新递减表的头指针 指向递增表1的头结点，用递增表1的头结点作为新递减表的头结点</span></span><br><span class="line">    head3-&gt;next = <span class="literal">NULL</span>; <span class="comment">//初始化新递减表头结点的指针域  因为已用移动结点指针1记录递增表1的第一个结点，数据不会丢失</span></span><br><span class="line"></span><br><span class="line">    LNode *temp; <span class="comment">//临时结点指针 指向当前要插入新递减表表头的结点</span></span><br><span class="line"></span><br><span class="line">    <span class="keyword">while</span> ((p != <span class="literal">NULL</span>) &amp;&amp; (q != <span class="literal">NULL</span>)) <span class="comment">//遍历两递增表</span></span><br><span class="line">    &#123;</span><br><span class="line">        <span class="keyword">if</span> (p-&gt;data &lt;= q-&gt;data) <span class="comment">//比较结点的数值域数据</span></span><br><span class="line">        &#123;</span><br><span class="line">            temp = p;    <span class="comment">//将临时结点指针指向数据域数值小的结点</span></span><br><span class="line">            p = p-&gt;next; <span class="comment">//递增表1的当前结点已被临时结点指针记录，更新移动结点指针1</span></span><br><span class="line"></span><br><span class="line">            temp-&gt;next = head3-&gt;next; <span class="comment">//将临时结点指针指向头结点的下一个结点</span></span><br><span class="line">            head3-&gt;next = temp;       <span class="comment">//将头指针指向当前要插入新递减表表头的结点</span></span><br><span class="line">        &#125;</span><br><span class="line">        <span class="keyword">else</span> <span class="comment">//同理</span></span><br><span class="line">        &#123;</span><br><span class="line">            temp = q;</span><br><span class="line">            q = q-&gt;next;</span><br><span class="line"></span><br><span class="line">            temp-&gt;next = head3-&gt;next;</span><br><span class="line">            head3-&gt;next = temp;</span><br><span class="line">        &#125;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">if</span> (p != <span class="literal">NULL</span>) <span class="comment">//若递增表2插入完成，递增表1还有未插入结点，则取剩余结点一个个插入新递减表表头</span></span><br><span class="line">    &#123;</span><br><span class="line">        temp = p;</span><br><span class="line">        p = p-&gt;next;</span><br><span class="line"></span><br><span class="line">        temp-&gt;next = head3-&gt;next;</span><br><span class="line">        head3-&gt;next = temp;</span><br><span class="line">    &#125;</span><br><span class="line">    <span class="keyword">if</span> (q != <span class="literal">NULL</span>) <span class="comment">//若递增表1插入完成，递增表2还有未插入结点，则取剩余结点一个个插入新递减表表头</span></span><br><span class="line">    &#123;</span><br><span class="line">        temp = q;</span><br><span class="line">        q = q-&gt;next;</span><br><span class="line"></span><br><span class="line">        temp-&gt;next = head3-&gt;next;</span><br><span class="line">        head3-&gt;next = temp;</span><br><span class="line">    &#125;</span><br><span class="line"></span><br><span class="line">    <span class="keyword">return</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure>
<hr>
<h1 id="总结"><a href="#总结" class="headerlink" title="总结"></a>总结</h1><p>不同参考资料中，单链表的描述实现各不相同，但基本思想是一致的。作者使用规范的变量命名、提供详细的步骤解析及使用示例，应用C&#x2F;C++语言将其整合成模板，以帮助理解记忆。</p>
<hr>
<h1 id="作者的话"><a href="#作者的话" class="headerlink" title="作者的话"></a>作者的话</h1><ul>
<li>作者：夜悊</li>
<li>版权所有，转载请注明出处，谢谢~</li>
<li><strong>如果文章对你有帮助，请点个赞或加个粉丝吧，你的支持就是作者的动力~</strong></li>
<li>文章在描述时有疑惑的地方，请留言，定会一一耐心讨论、解答</li>
<li>文章在认识上有错误的地方, 敬请批评指正</li>
<li>望读者们都能有所收获</li>
</ul>
<hr>
<h1 id="参考资料"><a href="#参考资料" class="headerlink" title="参考资料"></a>参考资料</h1><ul>
<li>《2023版数据结构高分笔记》主编：率辉</li>
<li>《2023年计算机组成原理考研复习指导》组编：王道论坛</li>
<li>《大话数据结构》作者：程杰</li>
</ul>
</article><div class="post-copyright"><div class="post-copyright__author"><span class="post-copyright-meta"><i class="fas fa-circle-user fa-fw"></i>文章作者: </span><span class="post-copyright-info"><a href="http://example.com">夜悊</a></span></div><div class="post-copyright__type"><span class="post-copyright-meta"><i class="fas fa-square-arrow-up-right fa-fw"></i>文章链接: </span><span class="post-copyright-info"><a href="http://example.com/2022/04/26/%E5%8D%95%E9%93%BE%E8%A1%A8%E7%9A%84C_C++%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%E5%AE%9E%E7%8E%B0%E6%A8%A1%E6%9D%BF/">http://example.com/2022/04/26/单链表的C_C++语言描述实现模板/</a></span></div><div class="post-copyright__notice"><span class="post-copyright-meta"><i class="fas fa-circle-exclamation fa-fw"></i>版权声明: </span><span class="post-copyright-info">本博客所有文章除特别声明外，均采用 <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank">CC BY-NC-SA 4.0</a> 许可协议。转载请注明来自 <a href="http://example.com" target="_blank">夜悊的技术小宅</a>！</span></div></div><div class="tag_share"><div class="post-meta__tag-list"><a class="post-meta__tags" href="/tags/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/">数据结构</a></div><div class="post_share"><div class="social-share" data-image="/img/cover20.png" data-sites="qq,wechat,weibo"></div><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/butterfly-extsrc@1.1.3/sharejs/dist/css/share.min.css" media="print" onload="this.media='all'"><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc@1.1.3/sharejs/dist/js/social-share.min.js" defer></script></div></div><nav class="pagination-post" id="pagination"><div class="prev-post pull-left"><a href="/2022/04/23/%E9%A1%BA%E5%BA%8F%E8%A1%A8%E7%9A%84C_C++%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%E5%AE%9E%E7%8E%B0%E6%A8%A1%E6%9D%BF/" title="顺序表的C_C++语言描述实现模板"><img class="cover" src= "" data-lazy-src="/img/cover9.png" onerror="onerror=null;src='/img/404.jpg'" alt="cover of previous post"><div class="pagination-info"><div class="label">上一篇</div><div class="prev_info">顺序表的C_C++语言描述实现模板</div></div></a></div><div class="next-post pull-right"><a href="/2022/04/27/%E9%9D%99%E6%80%81%E9%93%BE%E8%A1%A8%E7%9A%84C++%E8%AF%AD%E8%A8%80%E6%8F%8F%E8%BF%B0%E5%AE%9E%E7%8E%B0%E6%A8%A1%E6%9D%BF/" title="静态链表的C++语言描述实现模板"><img class="cover" src= "" data-lazy-src="/img/cover7.png" onerror="onerror=null;src='/img/404.jpg'" alt="cover of next post"><div class="pagination-info"><div class="label">下一篇</div><div class="next_info">静态链表的C++语言描述实现模板</div></div></a></div></nav><div class="relatedPosts"><div class="headline"><i class="fas fa-thumbs-up fa-fw"></i><span>相关推荐</span></div><div class="relatedPosts-list"><div><a href="/2022/10/19/%E2%80%9C%E5%9B%BE%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2/" title="“图”学习提纲"><img class="cover" src= "" data-lazy-src="/img/cover19.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-10-19</div><div class="title">“图”学习提纲</div></div></a></div><div><a href="/2022/09/23/%E2%80%9C%E6%8E%92%E5%BA%8F%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2/" title="“排序”学习提纲"><img class="cover" src= "" data-lazy-src="/img/cover13.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-09-23</div><div class="title">“排序”学习提纲</div></div></a></div><div><a href="/2022/08/24/%E2%80%9C%E6%95%B0%E7%BB%84%E3%80%81%E7%9F%A9%E9%98%B5%E4%B8%8E%E5%B9%BF%E4%B9%89%E8%A1%A8%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2/" title="“数组、矩阵与广义表”学习提纲"><img class="cover" src= "" data-lazy-src="/img/cover2.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-08-24</div><div class="title">“数组、矩阵与广义表”学习提纲</div></div></a></div><div><a href="/2022/09/08/%E2%80%9C%E6%9F%A5%E6%89%BE%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2%EF%BC%88%E4%B8%80%EF%BC%89%E2%80%94%E2%80%94%E7%BA%BF%E6%80%A7%E6%9F%A5%E6%89%BE/" title="“查找”学习提纲（一）——线性查找"><img class="cover" src= "" data-lazy-src="/img/cover16.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-09-08</div><div class="title">“查找”学习提纲（一）——线性查找</div></div></a></div><div><a href="/2022/09/21/%E2%80%9C%E6%9F%A5%E6%89%BE%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2%EF%BC%88%E4%B8%89%EF%BC%89%E2%80%94%E2%80%94%E6%80%BB%E7%BB%93/" title="“查找”学习提纲（三）——总结"><img class="cover" src= "" data-lazy-src="/img/cover5.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-09-21</div><div class="title">“查找”学习提纲（三）——总结</div></div></a></div><div><a href="/2022/09/19/%E2%80%9C%E6%9F%A5%E6%89%BE%E2%80%9D%E5%AD%A6%E4%B9%A0%E6%8F%90%E7%BA%B2%EF%BC%88%E4%BA%8C%EF%BC%89%E2%80%94%E2%80%94%E6%A0%91%E5%9E%8B%E6%9F%A5%E6%89%BE%E5%92%8C%E6%95%A3%E5%88%97%E6%9F%A5%E6%89%BE/" title="“查找”学习提纲（二）——树型查找和散列查找"><img class="cover" src= "" data-lazy-src="/img/cover2.png" alt="cover"><div class="content is-center"><div class="date"><i class="far fa-calendar-alt fa-fw"></i> 2022-09-19</div><div class="title">“查找”学习提纲（二）——树型查找和散列查找</div></div></a></div></div></div></div><div class="aside-content" id="aside-content"><div class="sticky_layout"><div class="card-widget" id="card-toc"><div class="item-headline"><i class="fas fa-stream"></i><span>目录</span><span class="toc-percentage"></span></div><div class="toc-content is-expand"><ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#%E5%89%8D%E8%A8%80"><span class="toc-number">1.</span> <span class="toc-text">前言</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E4%BB%A3%E7%A0%81%E4%BB%93%E5%BA%93"><span class="toc-number">2.</span> <span class="toc-text">代码仓库</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#linkList-cpp"><span class="toc-number">3.</span> <span class="toc-text">linkList.cpp</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%80%BB%E7%BB%93"><span class="toc-number">4.</span> <span class="toc-text">总结</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E4%BD%9C%E8%80%85%E7%9A%84%E8%AF%9D"><span class="toc-number">5.</span> <span class="toc-text">作者的话</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E5%8F%82%E8%80%83%E8%B5%84%E6%96%99"><span class="toc-number">6.</span> <span class="toc-text">参考资料</span></a></li></ol></div></div></div></div></main><footer id="footer" style="background-image: url('/img/cover20.png')"><div id="footer-wrap"><div class="copyright">&copy;2023 - 2025 By 夜悊</div><div class="footer_custom_text"><a target="_blank" href="https://beian.miit.gov.cn/" >琼ICP备2023001225号-1</a><br><img src= "" data-lazy-src="/img/beian.png"/>&nbsp<a target="_blank" href="https://www.beian.gov.cn/portal/registerSystemInfo?recordcode=46010802001221" >琼公网安备 46010802001221号</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="translateLink" type="button" title="简繁转换">繁</button><button id="readmode" type="button" title="阅读模式"><i class="fas fa-book-open"></i></button></div><div id="rightside-config-show"><button id="rightside-config" type="button" title="设置"><i class="fas fa-cog fa-spin"></i></button><button id="hide-aside-btn" type="button" title="单栏和双栏切换"><i class="fas fa-arrows-alt-h"></i></button><button id="darkmode" type="button" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button><button id="go-up" type="button" title="回到顶部"><span class="scroll-percent"></span><i class="fas fa-arrow-up"></i></button></div></div><div><script src="/js/utils.js?v=4.13.0"></script><script src="/js/main.js?v=4.13.0"></script><script src="/js/tw_cn.js?v=4.13.0"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/ui@5.0.33/dist/fancybox/fancybox.umd.min.js"></script><script src="https://cdn.jsdelivr.net/npm/vanilla-lazyload@17.8.8/dist/lazyload.iife.min.js"></script><div class="js-pjax"></div><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><div id="local-search"><div class="search-dialog"><nav class="search-nav"><span class="search-dialog-title">搜索</span><span id="loading-status"></span><button class="search-close-button"><i class="fas fa-times"></i></button></nav><div class="is-center" id="loading-database"><i class="fas fa-spinner fa-pulse"></i><span>  数据库加载中</span></div><div class="search-wrap"><div id="local-search-input"><div class="local-search-box"><input class="local-search-box--input" placeholder="搜索文章" type="text"/></div></div><hr/><div id="local-search-results"></div><div id="local-search-stats-wrap"></div></div></div><div id="search-mask"></div><script src="/js/search/local-search.js?v=4.13.0"></script></div></div></body></html>